/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
struct node
{
    queue<int> ans;
    int len = 0;
} v[maxn];

struct people
{
    int x, id;
    bool operator<(const people &t)
    {
        return x < t.x;
    }
} a[maxn];
vector<people> p;
int main()
{
    IOS;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i].x;
        a[i].id = i;
    }

    sort(a, a + n);
    int cnt = 0, now = 0;
    for (int i = 0; i < n; i++)
    {
        if (a[i].x == 0)
        {
            v[cnt].ans.push(a[i].id);
            v[cnt++].len++;
        }
        else
        {
            int it = now;
            while (v[now].len != a[i].x - 1)
            {
                now = (now + 1) % cnt;
                if (now == it)
                {
                    p.push_back(a[i]);
                    break;
                }
            }
        }
    }

    getchar();
    getchar();
    return 0;
}
